Constructions of transitive latin hypercubes
نویسندگان
چکیده
A set of vertices of the q-ary n-dimensional Hamming space is called a distance-2 MDS code if it has exactly one element in intersection with every line. By an isotopism we mean an isometric transformation of the Hamming space that independently permutes the symbols in every coordinate but does not change the coordinate order. A set M of vertices is called transitive if its automorphism group (i.e., the stabilizer of M in the space isometry group) acts transitively on M . A set M is called isotopically transitive if its autotopy group acts transitively onM . We call a setM topolinear (propelinear) if it can be equipped with a group operation whose left multiplication can be always extended to an isotopism (respectively, a space isometry). It is proved that if the arity is even > 2 or divisible by a square of prime, then there exists a quasi-exponential (more tightly, exponential with respect to the square root of the space dimension) number of topolinear and, as a corollary, propelinear and isotopically transitive MDS codes. The set of isotopically transitive MDS codes in the 4-ary Hamming space is characterized.
منابع مشابه
A General Construction for Space-filling Latin Hypercubes
Abstract: We propose a general method for constructing Latin hypercubes of flexible run sizes for computer experiments. The method makes use of arrays with a special structure and Latin hypercubes. By using different such arrays and Latin hypercubes, the proposed method produces various types of Latin hypercubes including orthogonal and nearly orthogonal Latin hypercubes, sliced Latin hypercube...
متن کاملA Census of Small Latin Hypercubes
We count all latin cubes of order n ≤ 6 and latin hypercubes of order n ≤ 5 and dimension d ≤ 5. We classify these (hyper)cubes into isotopy classes and paratopy classes (main classes). For the same values of n and d we classify all d-ary quasigroups of order n into isomorphism classes and also count them according to the number of identity elements they possess (meaning we have counted the d-a...
متن کاملLatin k-hypercubes
We study k dimensional Latin hypercubes of order n. We describe the automorphism groups of the hypercubes and define the parity of a hypercube and relate the parity with the determinant of a permutation hypercube. We determine the parity in the orbits of the automorphism group. Based on this definition of parity we make a conjecture similar to the Alon-Tarsi conjecture. We define an orthogonali...
متن کاملOn the Structure of Orthogonal Latin Hypercubes
The structure of orthogonal Latin hypercubes(OLH) is established in vector space over GF(2). An upper bound on the number of columns of an OLH is given. An OLH whose number of columns reaches the upper bound are found for m = 3 and m = 4, while the cases for m 5 are still unknown.
متن کاملEfficient Nearly Orthogonal and Space-Filling Latin Hypercubes
This article presents an algorithm for constructing orthogonal Latin hypercubes, given a fixed sample size, in more dimensions than previous approaches. In addition, we detail a method that dramatically improves the space-filling properties of the resultant Latin hypercubes at the expense of inducing small correlations between the columns in the design matrix. Although the designs are applicabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 54 شماره
صفحات -
تاریخ انتشار 2016